Orthogonalizing Weights of Tchebychev Sets of Polynomials
نویسندگان
چکیده
We characterize distributions with respect to which the members of a Tchebychev set of polynomials are orthogonal when they satisfy differential equations with polynomial coefficients. As an application, we find a real weight of bounded variation with support in [0, oo) for Bessel polynomials.
منابع مشابه
Certain Combinatorial Identities of Twin Pairs Related to Tchebychev Polynomials
In the present paper, a twin pair (xn, yn) and (Xn, Yn) of numbers related to one and two variable Tchebychev polynomials of first and second kinds are proposed. Certain Combinatorial Identities of the twin pairs are stated and proved.
متن کاملOn associated polynomials and decay rates for birth-death processes
We consider sequences of orthogonal polynomials and pursue the question of how (partial) knowledge of the orthogonalizing measure for the associated polynomials can lead to information about the orthogonalizing measure for the original polynomials. In particular, we relate the supports of the two measures, and their moments. As an application we analyse the relation between two decay rates conn...
متن کاملAssociated polynomials and birth-death processes
We consider sequences of orthogonal polynomials with positive zeros, and pursue the question of how (partial) knowledge of the orthogonalizing measure for the associated polynomials can lead to information about the orthogonalizing measure for the original polynomials, with a view to applications in the setting of birth-death processes. In particular, we relate the supports of the two measures,...
متن کاملComparison of inequalities for the minimax series via Tchebychev polynomials
In this paper several remarkable inequalities for the product with minimax series are considered and are compared via the valuation of these inequalities on Tchebyshev’s polynomials. c © 1998 Elsevier Science B.V. All rights reserved.
متن کاملReal roots of univariate polynomials and straight line programs
We give a new proof of the NP-hardness of deciding the existence of real roots of an integer univariate polynomial encoded by a straight line program based on certain properties of the Tchebychev polynomials. These techniques allow us to prove some new NP-hardness results related to real root approximation for polynomials given by straight line programs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006